Dynamical properties of model communication networks
نویسندگان
چکیده
منابع مشابه
Dynamical properties of model communication networks.
We study the dynamical properties of a collection of models for communication processes, characterized by a single parameter xi representing the relation between information load of the nodes and its ability to deliver this information. The critical transition to congestion reported so far occurs only for xi=1. This case is well analyzed for different network topologies. We focus on the propert...
متن کاملDynamical Properties of Discrete Reaction Networks
Reaction networks are commonly used to model the dynamics of populations subject to transformations that follow an imposed stoichiometry. This paper focuses on the efficient characterisation of dynamical properties of Discrete Reaction Networks (DRNs). DRNs can be seen as modeling the underlying discrete nondeterministic transitions of stochastic models of reaction networks. In that sense, a pr...
متن کاملOn Dynamical Properties of Neural Networks
A t ransform is introduced that maps cellular automata and discrete neural networks to dynamical systems on the unit interval. This transform is a topological conjugacy except at countably many points. In many cases, it gives rise to continuous full conjugates , in which case the transform preserves entropy. The transform also allows transfer of many dynamical properties of continuous systems t...
متن کاملDynamical and spectral properties of complex networks
Dynamical properties of complex networks are related to the spectral properties of the Laplacian matrix that describes the pattern of connectivity of the network. In particular we compute the synchronization time for different types of networks and different dynamics. We show that the main dependence of the synchronization time is on the smallest nonzero eigenvalue of the Laplacian matrix, in c...
متن کاملStructure Properties of Koch Networks Based on Networks Dynamical Systems
We introduce an informative labeling algorithm for the vertices of a family of Koch networks. Each of the labels is consisted of two parts, the precise position and the time adding to Koch networks. The shortest path routing between any two vertices is determined only on the basis of their labels, and the routing is calculated only by few computations. The rigorous solutions of betweenness cent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2002
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.66.026704